On Algorithmic Statistics for Space-bounded Algorithms
نویسندگان
چکیده
منابع مشابه
On Space Bounded Server Algorithms
This paper studies space bounded algorithms, i.e., algorithms that use a constant amount of scratch space, for the k{server problem. The paper rst shows a characterization of the set of space bounded algorithms that are competitive in nite metric spaces. The result yields a method for (1) e ectively deciding if a given space bounded algorithm is competitive in a given nite metric space, and (2)...
متن کاملRestricted Space Algorithms for Isomorphism on Bounded Treewidth Graphs
The Graph Isomorphism problem restricted to graphs of bounded treewidth or bounded tree distance width are known to be solvable in polynomial time [2],[19]. We give restricted space algorithms for these problems proving the following results: • Isomorphism for bounded tree distance width graphs is in L and thus complete for the class. We also show that for this kind of graphs a canon can be com...
متن کاملOn Algorithmic Strong Sufficient Statistics
The notion of a strong sufficient statistic was introduced in [N. Vereshchagin, Algorithmic Minimal Sufficient Statistic Revisited. Proc. 5th Conference on Computability in Europe, CiE 2009, LNCS 5635, pp. 478-487]. In this paper, we give a survey of fine properties of strong sufficient statistics and show that there are strings for which complexity of every strong sufficient statistic is much ...
متن کاملAlgorithmic Statistics
While Kolmogorov complexity is the accepted absolute measure of information content of an individual finite object, a similarly absolute notion is needed for the relation between an individual data sample and an individual model summarizing the information in the data, for example, a finite set (or probability distribution) where the data sample typically came from. The statistical theory based...
متن کاملDeterministic Amplification of Space-Bounded Probabilistic Algorithms
This paper initiates the study of deterministic amplification of space-bounded probabilistic algorithms. The straightforward implementations of known amplification methods cannot be used for such algorithms, since they consume too much space. We present a new implementation of the Ajtai-Komlós-Szemerédi method, that enables to amplify an S-space algorithm that uses r random bits and errs with p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory of Computing Systems
سال: 2018
ISSN: 1432-4350,1433-0490
DOI: 10.1007/s00224-018-9845-6